Some consequence relations on propositional formulas

Some Supervaluation-based Consequence Relations

In this paper, we define some consequence relations based on supervaluation semantics for partial models, and we investigate their properties. For our main consequence relation, we show that natural versions of the following fail: upwards and downwards Lowenheim–Skolem, axiomatizability, and compactness. We also consider an alternate version for supervaluation semantics, and show both axiomatiz...

Approximation of Relations by Propositional Formulas: Complexity and Semantics

Proof Theories for Some Prioritized Consequence Relations

Handling a possibly inconsistent prioritized belief base can be done in terms of consistent subsets. Humans do not compute consistent subsets, they just start reasoning and when confronted with inconsistencies in the course of their reasoning, they may adjust their interpretation of the information. In logics this behaviour corresponds to the mechanisms of dynamic proof theories. The aim of thi...

On meta complexity of propositional formulas and propositional proofs

A new approach to defining complexity of propositional formulas and proofs is suggested. Instead of measuring the size of these syntactical structures in the propositional language, the article suggests to define the complexity by the size of external descriptions of such constructions. The main result is a lower bound on proof complexity with respect to this new definition of complexity.

Establishing Propositional Relations in Reading Stories

This study examined the establishment of coherence relations by Persian EFL learners in their reading of stories. 201 undergraduate EFL learners read narrative passages and selected appropriate coherence elements of different types necessary for the proper construction of meaning. The results demonstrated a consistent pattern of a text-specific hierarchy for the comprehension of conjunctive rel...